Effects of Hard Real-Time Constraints in Implementing the Myopic Scheduling Algorithm

Myopic is a hard real-time process scheduling algorithm that selects a suitable process based on a heuristic function from a subset (Window) of all ready processes instead of choosing from all available processes, like original heuristic scheduling algorithm. Performance of the algorithm significantly depends on the chosen heuristic function that assigns weight to different parameters like deadline, earliest starting time, processing time etc. and the size of the Window since it considers only processes from processes (where, k n n k ≤ ). This research evaluates the performance of the Myopic algorithm for different parameters to demonstrate the merits and constraints of the algorithm. A comparative performance of the impact of window size in implementing the Myopic algorithm is presented and discussed through a set of experiments. Keywords-Original scheduling algorithm, Myopic algorithm, window size, earliest starting time, processing time, deadline of a process, dispatch queue, heuristic function.